The Security Assignment Problem and Its Solution
نویسندگان
چکیده
In this paper we derived a new method for finding the optimal solution to security assignment problems using projection onto convex set. This study will help communities find number of assigned and reserved personnels in designating officers an area. is applicable as well CCTV problems. The main goal give that can be applied solving We used some known properties optimization proving solution, such concept proximity operator, set, primal dual problem. addition that, basic knowledge graph theory answer our real-life application study. results showed found instances when problem exists solutions exist, determine explicitly. Also, proved there always Pseudo-solution problems, if exists, then coincide with it. most important aspect introduction
منابع مشابه
the geopolitics of afghanistan after september 11, 2001, and its impact on iranian national security
abstract u.s. attack to afghanistan after 9/11 provided opportunities for us who tried to become the dominant power after collapse of ussr and bipolar world. thinkers like fukuyama believed american liberal democrats thought would be universally accepted without resistances. liberal democracy is the best and final model of governance; in this regard, united state has moral responsibilities for...
15 صفحه اولsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
The Generalized Assignment Problem and Its Generalizations
The generalized assignment problem is a classical combinatorial optimization problem that models a variety of real world applications including flexible manufacturing systems [6], facility location [11] and vehicle routing problems [2]. Given n jobs J = {1, 2, . . . , n} and m agents I = {1, 2, . . . ,m}, the goal is to determine a minimum cost assignment subject to assigning each job to exactl...
متن کاملA Nonconvex Minlp Optimization Problem in Reactor Design and Production Assignment: Its Formulation and Global Solution
In this work, we address the rigorous and efficient determination of the global solution of a nonconvex MINLP problem arising from product portfolio optimization introduced by Kallrath (2003). The goal of the optimization problem is to determine the optimal number and capacity of reactors satisfying the demand and leading to a minimal total cost. Based on the model developed by Kallrath (2003),...
متن کاملThe Temporal Knapsack Problem and Its Solution
This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a mul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Analysis and Applications
سال: 2023
ISSN: ['2291-8639']
DOI: https://doi.org/10.28924/2291-8639-21-2023-72